#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout<< #x << " = " << x <<endl;
#define endl "\n"
typedef long long ll;
void solve() {
int n; cin >> n;
vector< int > ca, cb;
vector< int > pa, pb;
for(int i = 0; i < n; i ++) {
int a, b; cin >> a >> b;
ca.push_back(a); cb.push_back(b);
}
int m; cin >> m;
for(int i = 0; i < m; i ++) {
int a, b; cin >> a >> b;
pa.push_back(a); pb.push_back(b);
}
sort(ca.begin(), ca.end());
sort(pa.begin(), pa.end());
sort(cb.begin(), cb.end());
sort(pb.begin(), pb.end());
int ans = pa[m - 1] - cb[0];
ans = max(ans, ca[n - 1] - pb[0]);
ans = max(ans, 0);
cout<< ans << endl;
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(0);
int T = 1;
//cin >> T;
while(T --) {
solve();
}
return 0;
}
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |